Probabilistic and quantum institutions revisited

نویسندگان

  • Pedro Baltazar
  • Jaime Ramos
  • Cristina Sernadas
چکیده

We revisit quantum institutions as in [2] and solve some problems identified therein. Global, probabilistic and quantum exogenous enrichments of logics are adapted to a new notion of global model. For simplicity sake, all the constructions are presented in the realm of satisfaction systems, which proves to be an appropriate framework for defining the new logics. It also provides suitable constructions for studying the relationship between these enrichments and compare them with the constructions of [2]. Nevertheless, all the constructions are shown to be easily extended to institutions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Institutions

The exogenous approach to enriching any given base logic for probabilistic and quantum reasoning is brought into the realm of institutions. The theory of institutions helps in capturing the precise relationships between the logics that are obtained, and, furthermore, helps in analyzing some of the key design decisions and opens the way to make the approach more useful and, at the same time, mor...

متن کامل

Deutsch's Universal Quantum Turing Machine (revisited)

Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. This interesting problem has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani. Quantum Turing...

متن کامل

nt - p h / 07 01 10 8 v 1 1 6 Ja n 20 07 Deutsch ’ s Universal Quantum Turing Machine ( Revisited ) Willem Fouché ( Department of Decision Sciences

Deutsch, Feynman, and Manin viewed quantum computing as a kind of universal physical simulation procedure. Much of the writing about quantum Turing machines has shown how these machines can simulate an arbitrary unitary transformation on a finite number of qubits. This interesting problem has been addressed most famously in a paper by Deutsch, and later by Bernstein and Vazirani. Quantum Turing...

متن کامل

Succinctness of two-way probabilistic and quantum finite automata

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...

متن کامل

Categorical Abstract Algebraic Logic: Equivalential

The theory of equivalential deductive systems, as introduced by Prucnal and Wroński and further developed by Czelakowski, is abstracted to cover the case of logical systems formalized as π-institutions. More precisely, the notion of an N-equivalence system for a given π-institution is introduced. A characterization theorem for N-equivalence systems, previously proven for N-parameterized equival...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006